Fast Algorithms for Diameter-Optimally Augmenting Paths
نویسندگان
چکیده
We consider the problem of augmenting a graph with n vertices embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting graph. We present an exact algorithm for the cases when the input graph is a path that runs in O(n log n) time. We also present an algorithm that computes a (1 + ε)approximation in O(n+1/ε) time for paths in R, where d is a constant.
منابع مشابه
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees
We consider the problem of augmenting an n-vertex graph embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting graph. We present exact algorithms for the cases when (i) the input graph is a path, running in O(n log n) time, and (ii) the input graph is a tree, running in O(n2 logn) time. We also present an algorithm for paths that computes...
متن کاملAn Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space
Let P be a path graph of n vertices embedded in a metric space. We consider the problem of adding a new edge to P such that the diameter of the resulting graph is minimized. Previously (in ICALP 2015) the problem was solved in O(n log3 n) time. In this paper, based on new observations and different algorithmic techniques, we present an O(n logn) time algorithm.
متن کاملCompetitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems
Rapid advances in image acquisition and storage technology underline the need for algorithms that are capable of solving large scale image processing and computer-vision problems. The minimum cut problem plays an important role in processing many of these imaging problems such as, image and video segmentation, stereo vision, multi-view reconstruction and surface fitting. While several min-cut/m...
متن کاملMinimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts
We seek to augment a geometric network in the Euclidean plane with shortcuts to minimize its continuous diameter, i.e., the largest network distance between any two points on the augmented network. Unlike in the discrete setting where a shortcut connects two vertices and the diameter is measured between vertices, we take all points along the edges of the network into account when placing a shor...
متن کاملFinite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data
This paper considers two similar graph algorithms that work by repeatedly increasing “flow” along “augmenting paths”: the Ford-Fulkerson algorithm for the maximum flow problem and the Gale-Shapley algorithm for the stable allocation problem (a many-to-many generalization of the stable matching problem). Both algorithms clearly terminate when given integral input data. For real-valued input data...
متن کامل